Evolving graphs and least cost journeys in dynamic networks
نویسندگان
چکیده
New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. This naturally engenders new route-discovery problems under changing conditions over these networks. In this paper, we use and extend a recently proposed graph theoretic model, which helps capture the evolving characteristic of such networks, in order to propose and formally analyze least cost journeys (the analog of paths in usual graphs) in a class of dynamic networks, where the changes in the topology can be predicted in advance. Cost measures investigated here are hop count (shortest journeys), arrival date (foremost journeys), and time span (fastest journeys).
منابع مشابه
Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks
New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. This naturally engenders new route-discovery problems under changing conditions over these networks. Unfortunately, the temporal variations in the network topology are hard to be effectively captured in a classical graph model. In ...
متن کاملSpatio-temporal Network Databases and Routing Algorithms: A Summary of Results
Spatio-temporal networks are spatial networks whose topology and parameters change with time. These networks are important due to many critical applications such as emergency traffic planning and route finding services and there is an immediate need for models that support the design of efficient algorithms for computing the frequent queries on such networks. This problem is challenging due to ...
متن کاملPerformance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs
The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks’ dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can ...
متن کاملOn the expressivity of time-varying graphs
In highly dynamic systems (such as wireless mobile ad-hoc networks, robotic swarms, vehicular networks, etc.) connectivity does not necessarily hold at a given time but temporal paths, or journeys, may still exist over time and space, rendering computing possible; some of these systems allow waiting (i.e., pauses at intermediate nodes, also referred to as store-carry-forward strategies) while o...
متن کاملShortest, Fastest, and Foremost Broadcast in Dynamic Networks
Highly dynamic networks rarely offer end-to-end connectivity at a given time. Yet, connectivity in these networks can be established over time and space, based on temporal analogues of multi-hop paths (also called journeys). Attempting to optimize the selection of the journeys in these networks naturally leads to the study of three cases: shortest (minimum hop), fastest (minimum duration), and ...
متن کامل